Research Reports on Mathematical and Computing Sciences Department of Mathematical and Computing Sciences
نویسندگان
چکیده
We first propose the notion of universal anonymizable public-key encryption. Suppose that we have the encrypted data made with the same security parameter, and that these data do not satisfy the anonymity property. Consider the situation that we would like to transform these encrypted data to those with the anonymity property without decrypting these encrypted data. In this paper, in order to formalize this situation, we propose a new property for public-key encryption called universal anonymoizablity. We then propose the universal anonymizable publickey encryption schemes based on RSA-OAEP, the ElGamal encryption, and the Cramer-Shoup encryption schemes, and prove their security.
منابع مشابه
Parallel computing using MPI and OpenMP on self-configured platform, UMZHPC.
Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...
متن کاملVM Consolidation by using Selection and Placement of VMs in Cloud Datacenters
The Cloud Computing model leverages virtualization of computing resources allowing customers to provision resources on-demand on a pay-as-you-go basis. During recent years, the power consumption of datacenters in cloud environment attracted researchers. Optimization of energy consumption can be performed by different methods including virtual machine (VM) consolidation. This technique can reduc...
متن کاملThe existence results for a coupled system of nonlinear fractional differential equations with multi-point boundary conditions
In this paper, we study a coupled system of nonlinear fractional differential equations with multi-point boundary condi- tions. The differential operator is taken in the Riemann-Liouville sense. Applying the Schauder fixed-point theorem and the contrac- tion mapping principle, two existence results are obtained for the following system D^{alpha}_{0+}x(t)=fleft(t,y(t),D^{p}_{0+}y(t)right), t in (0,...
متن کاملResearch Reports on Mathematical and Computing Sciences Department of Mathematical and Computing Sciences Tokyo Institute of Technology
A new notion of relativization—stringent relativization—has been proposed recently [CW06] for discussing collapsing relations of complexity classes, with which we hope to open a new approach for studying complexity classes. Starting with the motivation of this notion, we discuss the meaning and implication of collapsing relations under the stringent relativization.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کامل